Search results for "Clustering coefficient"

2016

Focal demyelinated lesions, diffuse white matter (WM) damage and grey matter (GM) atrophy influence directly the disease progression in patients with multiple sclerosis. The aim of this study was to identify specific characteristics of GM and WM structural networks in subjects with clinically isolated syndrome (CIS) in comparison to patients with early relapsing-remitting multiple sclerosis (RRMS). Twenty patients with CIS, thirty three with RRMS and forty healthy subjects were investigated using 3 T-MRI. Diffusion tensor imaging was applied, together with probabilistic tractography and fractional anisotropy (FA) maps for WM and cortical thickness correlation analysis for GM, to determine t…

Application of Graph Clustering and Visualisation Methods to Analysis of Biomolecular Data

2018

In this paper we present an approach based on integrated use of graph clustering and visualisation methods for semi-supervised discovery of biologically significant features in biomolecular data sets. We describe several clustering algorithms that have been custom designed for analysis of biomolecular data and feature an iterated two step approach involving initial computation of thresholds and other parameters used in clustering algorithms, which is followed by identification of connected graph components, and, if needed, by adjustment of clustering parameters for processing of individual subgraphs.

Transient seizure onset network for localization of epileptogenic zone: effective connectivity and graph theory-based analyses of ECoG data in tempor…

2018

Objective: Abnormal and dynamic epileptogenic networks cause difficulties for clinical epileptologists in the localization of the seizure onset zone (SOZ) and the epileptogenic zone (EZ) in preoperative assessments of patients with refractory epilepsy. The aim of this study is to investigate the characteristics of time-varying effective connectivity networks in various non-seizure and seizure periods, and to propose a quantitative approach for accurate localization of SOZ and EZ. Methods: We used electrocorticogram recordings in the temporal lobe and hippocampus from seven patients with temporal lobe epilepsy to characterize the effective connectivity dynamics at a high temporal resolution …

Functional connectivity analysis using whole brain and regional network metrics in MS patients

2016

In the present study we investigated brain network connectivity differences between patients with relapsing-remitting multiple sclerosis (RRMS) and healthy controls (HC) as derived from functional resonance magnetic imaging (fMRI) using graph theory. Resting state fMRI data of 18 RRMS patients (12 female, mean age ± SD: 42 ± 12.06 years) and 25 HC (8 female, 29.2 ± 5.38 years) were analyzed. In order to obtain information of differences in entire brain network, we focused on both, local and global network connectivity parameters. And the regional connectivity differences were assessed using regional network parameters. RRMS patients presented a significant increase of modularity in comparis…

Evolution of Cooperation Patterns in Psoriasis Research: Co-Authorship Network Analysis of Papers in Medline (1942–2013)

2015

BackgroundAlthough researchers have worked in collaboration since the origins of modern science and the publication of the first scientific journals in the eighteenth century, this phenomenon has acquired exceptional importance in the last several decades. Since the mid-twentieth century, new knowledge has been generated from within an ever-growing network of investigators, working cooperatively in research groups across countries and institutions. Cooperation is a crucial determinant of academic success.ObjectiveThe aim of the present paper is to analyze the evolution of scientific collaboration at the micro level, with regard to the scientific production generated on psoriasis research.Me…

Structural clustering of millions of molecular graphs

2014

We propose an algorithm for clustering very large molecular graph databases according to scaffolds (i.e., large structural overlaps) that are common between cluster members. Our approach first partitions the original dataset into several smaller datasets using a greedy clustering approach named APreClus based on dynamic seed clustering. APreClus is an online and instance incremental clustering algorithm delaying the final cluster assignment of an instance until one of the so-called pending clusters the instance belongs to has reached significant size and is converted to a fixed cluster. Once a cluster is fixed, APreClus recalculates the cluster centers, which are used as representatives for…

Topology of synaptic connectivity constrains neuronal stimulus representation, predicting two complementary coding strategies

2022

In motor-related brain regions, movement intention has been successfully decoded from in-vivo spike train by isolating a lower-dimension manifold that the high-dimensional spiking activity is constrained to. The mechanism enforcing this constraint remains unclear, although it has been hypothesized to be implemented by the connectivity of the sampled neurons. We test this idea and explore the interactions between local synaptic connectivity and its ability to encode information in a lower dimensional manifold through simulations of a detailed microcircuit model with realistic sources of noise. We confirm that even in isolation such a model can encode the identity of different stimuli in a lo…

Complex networks : application for texture characterization and classification

2008

This article describes a new method and approch of texture characterization. Using complex network representation of an image, classical and derived (hierarchical) measurements, we presente how to have good performance in texture classification. Image is represented by a complex networks : one pixel as a node. Node degree and clustering coefficient, using with traditionnal and extended hierarchical measurements, are used to characterize ”organisation” of textures.

Percolation on correlated random networks

2011

We consider a class of random, weighted networks, obtained through a redefinition of patterns in an Hopfield-like model and, by performing percolation processes, we get information about topology and resilience properties of the networks themselves. Given the weighted nature of the graphs, different kinds of bond percolation can be studied: stochastic (deleting links randomly) and deterministic (deleting links based on rank weights), each mimicking a different physical process. The evolution of the network is accordingly different, as evidenced by the behavior of the largest component size and of the distribution of cluster sizes. In particular, we can derive that weak ties are crucial in o…

An Empirical Study of the Relation Between Community Structure and Transitivity

2012

One of the most prominent properties in real-world networks is the presence of a community structure, i.e. dense and loosely interconnected groups of nodes called communities. In an attempt to better understand this concept, we study the relationship between the strength of the community structure and the network transitivity (or clustering coefficient). Although intuitively appealing, this analysis was not performed before. We adopt an approach based on random models to empirically study how one property varies depending on the other. It turns out the transitivity increases with the community structure strength, and is also affected by the distribution of the community sizes. Furthermore, …